type github.com/andybalholm/brotli.hashLongestMatchQuickly

15 uses

	github.com/andybalholm/brotli (current package)
		hash.go#L235: 		return &hashLongestMatchQuickly{
		hash.go#L242: 		return &hashLongestMatchQuickly{
		hash.go#L249: 		return &hashLongestMatchQuickly{
		hash.go#L288: 		return &hashLongestMatchQuickly{
		hash_longest_match_quickly.go#L15: func (*hashLongestMatchQuickly) HashTypeLength() uint {
		hash_longest_match_quickly.go#L19: func (*hashLongestMatchQuickly) StoreLookahead() uint {
		hash_longest_match_quickly.go#L26: func (h *hashLongestMatchQuickly) HashBytes(data []byte) uint32 {
		hash_longest_match_quickly.go#L39: type hashLongestMatchQuickly struct {
		hash_longest_match_quickly.go#L50: func (h *hashLongestMatchQuickly) Initialize(params *encoderParams) {
		hash_longest_match_quickly.go#L54: func (h *hashLongestMatchQuickly) Prepare(one_shot bool, input_size uint, data []byte) {
		hash_longest_match_quickly.go#L79: func (h *hashLongestMatchQuickly) Store(data []byte, mask uint, ix uint) {
		hash_longest_match_quickly.go#L86: func (h *hashLongestMatchQuickly) StoreRange(data []byte, mask uint, ix_start uint, ix_end uint) {
		hash_longest_match_quickly.go#L93: func (h *hashLongestMatchQuickly) StitchToPreviousBlock(num_bytes uint, position uint, ringbuffer []byte, ringbuffer_mask uint) {
		hash_longest_match_quickly.go#L104: func (*hashLongestMatchQuickly) PrepareDistanceCache(distance_cache []int) {
		hash_longest_match_quickly.go#L115: func (h *hashLongestMatchQuickly) FindLongestMatch(dictionary *encoderDictionary, data []byte, ring_buffer_mask uint, distance_cache []int, cur_ix uint, max_length uint, max_backward uint, gap uint, max_distance uint, out *hasherSearchResult) {